Feature-Based Learning of Search-Guiding Heuristics for Theorem Proving
نویسندگان
چکیده
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics by employing features in a simple, yet eeective manner. Features are used to adapt a heuristic to a solved source problem. The adapted heuristic can then be utilized prootably for solving related target problems. Experiments have demonstrated that the approach allows a theorem prover to prove hard problems that were out of reach before.
منابع مشابه
Fakult at F Ur Informatik Der Technischen Universitt at M Unchen Lehrstuhl Viii Forschungsgruppe Automated Reasoning Feature-based Learning of Search-guiding Heuristics for Theorem Proving Feature-based Learning of Search-guiding Heuristics for Theorem Proving
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics ...
متن کاملA Feature-Based Learning Method for Theorem Proving
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics by employing features in a simple, yet effec...
متن کاملAutomatic Selection of Search-guiding Heuristics for Theorem Proving
Theorem proving essentially amounts to solving search problems. The intricacy of these in general undecidable problems makes the use of appropriate search-guiding heuristics indispensable. However, the appropriateness of a heuristic critically depends on the problem to be solved. Given a set of heuristics to choose from, selecting a suitable heuristic is hence a crucial, but also a very diicult...
متن کاملUsing Mixture of Experts Method in Combining Search-Guiding Heuristics for Theorem Proving
The main challenge of automated theorem proving is to find a way to shorten the search process. Therefore using a good heuristic method is essential. Instead of constructing a heuristic from scratch, we propose to use the mixture of experts learning to combine the existing heuristics to construct a heuristic from similar problems. The results show that the combined heuristic is better than each...
متن کاملA Connectionist Control Component for the Theorem Prover SETHEO
Today, the power of automated theorem provers is yet too weak for proving many challinging problems. However heuristics for guiding the proof search can dramatically improve the power of such provers. Since it is very diicult to develop heuristics by hand and since they have to be developed speciically for each problem domain (theory), we decided to derive heuristics automatically using machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- AI Commun.
دوره 11 شماره
صفحات -
تاریخ انتشار 1998